quasicompactible monoid - traduction vers russe
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:     

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

quasicompactible monoid - traduction vers russe

ALGEBRAIC STRUCTURE WITH AN ASSOCIATIVE OPERATION AND AN IDENTITY ELEMENT
Monoid (algebra); Commutative monoid; Monoid homomorphism; Monoids; Abelian monoid; Monoid morphism; Submonoid; Finitely generated monoid; Complete monoid; Continuous monoid
  • groups]]. For example, monoids are [[semigroup]]s with identity.
  • ('''N''', ×, 1)}}}}. It is injective, but not surjective.

quasicompactible monoid      

математика

квазисжимаемый моноид

finitely generated monoid         
конечно порожденный моноид
monoid homomorphism         

математика

гомоморфизм моноидов

Définition

monoid
An operator * and a value x form a monoid if * is associative and x is its left and right identity.

Wikipédia

Monoid

In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0.

Monoids are semigroups with identity. Such algebraic structures occur in several branches of mathematics.

The functions from a set into itself form a monoid with respect to function composition. More generally, in category theory, the morphisms of an object to itself form a monoid, and, conversely, a monoid may be viewed as a category with a single object.

In computer science and computer programming, the set of strings built from a given set of characters is a free monoid. Transition monoids and syntactic monoids are used in describing finite-state machines. Trace monoids and history monoids provide a foundation for process calculi and concurrent computing.

In theoretical computer science, the study of monoids is fundamental for automata theory (Krohn–Rhodes theory), and formal language theory (star height problem).

See semigroup for the history of the subject, and some other general properties of monoids.

Traduction de &#39quasicompactible monoid&#39 en Russe